Improved Upper Bounds on $a'(G\Box H)$

The acyclic edge colouring problem is extensively studied in graph theory. The corner-stone of this field is a conjecture of Alon et. al.[1] that a′(G) ≤ ∆(G) + 2. In that and subsequent work, a′(G) is typically bounded in terms of ∆(G). Motivated by this we introduce a term gap(G) defined as gap(G) = a′(G) − ∆(G). Alon’s conjecture can be rephrased as gap(G) ≤ 2 for all graphs G. In [5] it was shown that a′(G H) ≤ a′(G) + a′(H), under some assumptions. Based on Alon’s conjecture, we conjecture that a′(G H) ≤ a′(G) + ∆(H) under the same assumptions, resulting in a strengthening. The results of [1] validate our conjecture for the class of graphs it considers. We prove our conjecture for a significant subclass of sub-cubic graphs and state some generic conditions under which our conjecture can be proved. We suggest how our technique can be potentially applied by future researchers to expand the class of graphs for which our conjecture holds. Our results improve the understanding of the relationship between Cartesian Product and acyclic chromatic index. keywords: Acyclic edge colouring·Acyclic chromatic index·Cartesian Product ·Gap